An Unrelated Parallel Machines Rescheduling Problem: An Industrial Case Study
Abstract
This study tackles an unrelated parallel machines rescheduling problem. Sequence and machine dependent setup times and limited resources are taken into consideration. The study focuses on the objective of proposing an efficient and stable rescheduling solution. The resolution approach is explained and illustrated. Different indicators to optimize the rescheduling planning are tested and results are analyzed. The problem is inspired from a concrete case of textile industry.
Origin | Files produced by the author(s) |
---|---|
licence |